Connectivity and diameter in distance graphs

For n ∈ N and D ⊆ N, the distance graph P n has vertex set {0, 1, . . . , n− 1} and edge set {ij | 0 ≤ i, j ≤ n − 1, |j − i| ∈ D}. The class of distance graphs generalizes the important and very well-studied class of circulant graphs which have been proposed for numerous network applications. In view of fault tolerance and delay issues in these applications, the connectivity and diameter of circulant graphs have been studied in great detail. Our main contributions are hardness results concerning computational problems related to the connectivity and diameter of distance graphs and a number-theoretic characterization of the connected distance graphs P n for |D| = 2.